The Tail Assignment Problem: A Case Study at Vueling Airlines

To schedule aircraft, assignments of fleet types to flights and aircraft routes must be determined. The former is known as the assignment problem while latter routing in literature. Aircraft usually addressed a feasibility whose solution needed for constructing crew schedules. These problems are solved from 4 6 months before day operations. Therefore, there limited information regarding each aircraft’s operational condition. tail problem, which has received attention air transportation literature, when additional conditions revealed aiming at determining route operations accounting originally planned it We propose mathematical programming approach based on sequencing that captures all constraints maintenance requirements costs minimized. Computational experiments realistic cases drawn Spanish airline, features network with more than 1000 100 aircraft.